منابع مشابه
The non-Euclidean Euclidean algorithm
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a twogenerator real Möbius group acting on the Poincaré plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That is, the algorithm can be viewed as an application of the Euclidean division algorithm to real numbers that represent hyperbolic distances. In the case that t...
متن کاملEuclidean vs. non-Euclidean Gamma-Ray Bursts
We classify gamma-ray bursts (GRBs) according to their observed durations and physical properties of their spectra. We find that long/hard bursts (of duration T90 > 2.5 s, and typical photon energy Ep > ∼ 0.8 MeV corresponding to BATSE’s energy fluence hardness H 32 > 3) show the strongest deviation from the three-dimensional Euclidean brightness distribution. The majority of GRBs, i.e., short ...
متن کاملThe Euclidean Algorithm
In this note a constructive criterion for the existence of a Euclidean algorithm within a given integral domain is derived, and from among the different possible Euclidean algorithms in an integral domain one is singled out. The same is done for "transfinite" Euclidean algorithms. The criterion obtained is applied to some special rings, in particular rings of quadratic integers. By an example i...
متن کاملEuclidean Geometry before non-Euclidean Geometry
In [3], in my argument for the primacy of Euclidean geometry on the basis of rigid motions and the existence of similar but non-congruent triangles, I wrote the following: A: “The mobility of rigid objects is now recognized as one of the things every normal human child learns in infancy, and this learning appears to be part of our biological progaramming.” B. “. . . we are all used to thinking ...
متن کاملThe Accelerated Euclidean Algorithm
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log n log log n) time complexity of the Schönhage algorithm for n-bit inputs. This new GCD algorithm is designed for both integers and polynomials. We only focus our study to the integer case, the polynomial case is currently addressed [3]. The algorithm is based on a half-gcd like pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2014
ISSN: 0001-8708
DOI: 10.1016/j.aim.2013.09.012